Voting 'Against' in regular and nearly regular graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On nearly regular co-critical graphs

A graph G is called (K3,K3)-co-critical if the edges of G can be coloured with two colours without getting a monochromatic triangle, but adding any new edge to the graph, this kind of ’good’ colouring is impossible. In this short note we construct (K3,K3)-co-critical graphs of maximal degree O(n3/4).

متن کامل

Regular factors in regular graphs

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...

متن کامل

Regular Star Complements in Strongly Regular Graphs

We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50

متن کامل

Families of Regular Graphs in Regular Maps

The question of when a given graph can be the underlying graph of a regular map has roots a hundred years old and is currently the object of several threads of research. This paper outlines this topic briefly and proves that a product of graphs which have regular embeddings also has such an embedding. We then present constructions for members of three families: (1) circulant graphs, (2) wreath ...

متن کامل

Partially Distance-regular Graphs and Partially Walk-regular Graphs∗

We study partially distance-regular graphs and partially walkregular graphs as generalizations of distance-regular graphs and walkregular graphs respectively. We conclude that the partially distanceregular graphs can be viewed as some extremal graphs of partially walk-regular graphs. In the special case that the graph is assumed to be regular with four distinct eigenvalues, a well known class o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicable Analysis and Discrete Mathematics

سال: 2010

ISSN: 1452-8630

DOI: 10.2298/aadm1000014w